Maximizing PageRank with New Backlinks
نویسنده
چکیده
For a given node t in a directed graph G(VG, EG) and a positive integer k we study the problem of computing a set of k new links pointing to t – so called backlinks to t – producing the maximum increase in the PageRank value of t. This problem is known as Link Building in the www context. We present a theorem describing how the topology of the graph comes in to play when evaluating potential new backlinks. Based on the theorem we show that no FPTAS exists for Link Building under the assumption NP =P and we also show that Link Building is W[1]-hard.
منابع مشابه
An approximation algorithm for the link building problem
In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work shows that this problem has no fully polynomial time approximation schemes unless P = NP . We present a polynomial time algorithm yielding a PageRank value within a constant...
متن کاملA Constant-Factor Approximation Algorithm for the Link Building Problem
In this work we consider the problem of maximizing the PageRank of a given target node in a graph by adding k new links. We consider the case that the new links must point to the given target node (backlinks). Previous work [7] shows that this problem has no fully polynomial time approximation schemes unless P = NP . We present a polynomial time algorithm yielding a PageRank value within a cons...
متن کاملDiscovering and Leveraging the Most Valuable Links for Ranking
On the Web, visits of a page are often introduced by one or more valuable linking sources. Indeed, good back links are valuable resources for Web pages and sites. We propose to discovering and leveraging the best backlinks of pages for ranking. Similar to PageRank, MaxRank scores are updated recursively. In particular, with probability λ, the MaxRank of a document is updated from the backlink s...
متن کاملLink Building
Google uses the PageRank algorithm to compute an estimate of the popularity of each page based solely on the link structure of the web graph – these estimates are the so-called PageRank values. A page will achieve one of the top spots of a search result if it has a high PageRank value and matches the search criteria for the actual Google search. For a given page t and k ∈ Z+ we study the proble...
متن کاملWebpage Ranking Algorithms Second Exam Report
The traditional link analysis algorithms exploit the context information inherent in the hyperlink structure of the Web, with the premise being that a link from page A to page B denotes an endorsement of the quality of B. The exemplary PageRank algorithm weighs backlinks with a random surfer model; Kleinberg’s HITS algorithm promotes the use of hubs and authorities over a base set ; Lempel and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010